Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays
نویسندگان
چکیده
Efficient management of port resources plays a crucial role in reducing vessel stay times and avoiding the payment demurrage charges. In this paper, we focus on integrated Laycan Berth Allocation Quay Crane Assignment Problem, which considers three main decision problems an way: dynamic continuous Problem time-invariant Problem. second part, problem is extended to Specific Assignment, includes assignment set specific quay cranes each vessel, considering productivity their maximum outreach. The proposed integer programming models are original several ways. First, formulation uses predicates ensure flexibility implementation, significantly improve computational performance. numerical study shows that practical size can be solved optimality reasonable time using commercial software. Second, since studied have different levels, change time-interval incorporated inside planning horizon for seamless decision-making. Third, as close possible reality, consider both physical characteristics ports rarely together (tidal with multiple quays water depths) contractual clauses (non-working periods Charter Party clauses). output efficient schedule berthing chartered vessels crane assignment, laycans new charter.
منابع مشابه
Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem
Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...
متن کاملOptimal berth allocation and time-invariant quay crane assignment in container terminals
Due to the dramatic increase in the world’s container traffic, the efficient management of operations in seaport container terminals has become a crucial issue. In this work, we focus on the integrated planning of the following problems faced at container terminals: berth allocation, quay crane assignment (number), and quay crane assignment (specific). First, we formulate a new binary integer l...
متن کاملIntegrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results
Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated berth allocation and quay crane assignment problem in seaport container terminals. We will extend the current stateof-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techniq...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2021
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2020.12.056